Covering Codes for Hats-on-a-line

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Covering Codes for Hats-on-a-line

We consider a popular game puzzle, called Hats-on-a-line, wherein a warden has n prisoners, each one wearing a randomly assigned black or white hat, stand in a line. Thus each prisoner can see the colors of all hats before him, but not his or of those behind him. Everyone can hear the answer called out by each prisoner. Based on this information and without any further communication, each priso...

متن کامل

Inequalities for covering codes

Any code C with covering radius R must satisfy a set of linear inequalities that involve the Lloyd polynomial L R (x) ; these generalize the sphere bound. The "syndrome graphs" associated with a linear code C help to keep track of low weight vectors in the same coset of C (if there are too many such vectors C cannot exist). As illustrations it is shown that t[17,10] = 3 and t[23,15] = 3, where ...

متن کامل

On-Line Machine Covering

We consider the problem of scheduling a sequence of jobs to m parallel machines as to maximize the minimum load over the machines. This situation corresponds to a case that a system which consists of the m machines is alive (i.e. productive) only when all the machines are alive, and the system should be maintained alive as long as possible. It is well known that any on-line deterministic algori...

متن کامل

A note on bounds for q-ary covering codes

Two strongly seminormal codes over 2s are constructed to prove a conjecture of Ostergard. It is shown that a result of Honkala on ( I C , t)-subnormal codes holds also under weaker assumptions. A lower bound and an upper bound on Kq(n, R), the minimal cardinality of a q-ary code of length n with covering radius R are obtained. These give improvements in seven upper bounds and twelve lower bound...

متن کامل

Greedy Algorithms For On-Line Set-Covering

We study on-line models for the set-covering problem in which items from a ground set arrive one by one and with any such item c, the list of names of sets that contain it in the final instance is also presented possibly together with some information regarding the content of such sets. A decision maker has to select which set, among the sets containing c, has to be put in the solution in order...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: The Electronic Journal of Combinatorics

سال: 2006

ISSN: 1077-8926

DOI: 10.37236/1047